Modularity of Completeness Revisited
نویسنده
چکیده
One of the key results in the eld of modularity for Term Rewriting Systems is the modularity of completeness for left linear TRSs established by Toyama Klop and Barendregt in TKB The proof however is quite long and involved In this paper a new proof of this basic result is given which is both short and easy employing the powerful technique of pile and delete already used with success in proving the modularity of UN Moreover the same proof is shown to extend the result in TKB proving modularity of termination for left linear and consistent with respect to reduction TRSs
منابع مشابه
Maximizing Barber's bipartite modularity is also hard
Abstract Modularity introduced by Newman and Girvan [Phys. Rev. E 69, 026113 (2004)] is a quality function for community detection. Numerous methods for modularity maximization have been developed so far. In 2007, Barber [Phys. Rev. E 76, 066102 (2007)] introduced a variant of modularity called bipartite modularity which is appropriate for bipartite networks. Although maximizing the standard mo...
متن کاملOn Modularity of the Completeness in Order-Sorted Term Rewriting Systems
In this paper, we extend the results on the modularity of con uence and termination of single-sorted TRSs[3][6][7] to order-sorted ones. Order-sorted TRSs build a good framework for handling overloaded functions and subtypes. For proving modularity of completeness of ordersorted TRSs, we rst transform a TRS with overloaded functions to a non-overloaded one, and then we demonstrate that our tran...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملOn Modularity of Termination and Confluence Properties of Conditional Rewrite Systems
We investigate the modularity behaviour of termination and connuence properties of conditional term rewriting systems. In particular , we show how to obtain suucient conditions for the modularity of weak termination, weak innermost termination, (strong) innermost termination , (strong) termination, connuence and completeness of conditional rewrite systems.
متن کاملOn Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems
We investigate the modularity behaviour of termination and connuence properties of (join) conditional term rewriting systems. We give counterexamples showing that the properties weak termination, weak innermost termination and (strong) innermost termination are not preserved in general under signature extensions. Then we develop suucient conditions for the preservation of these properties under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995